Logic program synthesis from first-order logic specifications
نویسندگان
چکیده
منابع مشابه
Logic Program Synthesis from Incomplete Specifications
Program synthesis research aims at maximally automating the passage from specifications to programs (see the survey by Biermann, 1992). We define possible formalisms for the starting points (specifications: see Section 1.1) and results (programs: see Section 1.2) of synthesis, and state existing approaches and related work, before pinning down the objectives (Section 1.3) of this paper. Some fa...
متن کاملTop-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications
Derivation of logic programs from rst-order logic speciications is nontrivial and tends to be done by hand. We describe a method for synthesising recursive logic procedures from their rst-order logic speciications that is amenable to mechanisation. The method is strictly top-down and has been implemented as part of a user-guided synthesis system in Prolog.
متن کاملSYNAPSE- A System for Logic Program Synthesis from Incomplete Specifications
A logic program development methodology has been proposed by the second author [3]. It aims at programming-in-the-small, and is (mainly) meant for “algorithmic” problems. It starts from a complete, yet informal, specification of the target problem. A crucial step is the design of the logic of the program, based solely on the declarative semantics of logic, and with exclusive concern about corre...
متن کاملAutomation of Program Synthesis from Logic-Based Specifications
Introduction In [Manna and Waldinger, 1992] the deductive tableau method was proposed. It is appropriate for the synthesis of functional programs. The specification of a program is taken as a mathematical existence theorem and we prove the existence of an object that satisfies the specified conditions. Specification is based on predicate-logic, because it is quite general and appropriate for de...
متن کاملFrom Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model property. We exploit this property to give an encoding of this fragment into a first-order logic containing only the propositional connectives, quantification over the natural numbers and equality. This result is the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90202-x